QMDD Minimization Using Sifting for Variable Reordering
نویسندگان
چکیده
This paper considers variable reordering for quantum multiplevalued decision diagrams (QMDDs) used to represent the matrices describing reversible/quantum gates and circuits. An efficient method for adjacent variable interchange is presented and this method is employed to implement a vertex reduction procedure for QMDDs using sifting. Experimental results are presented showing the effectiveness of the proposed technique.
منابع مشابه
Minimization of Quantum Multiple-valued Decision Diagrams Using Data Structure Metrics
This paper describes new metrics for size minimization of the data structure referred to as quantum multiple-valued decision diagrams (QMDD). QMDD are used to represent the matrices describing reversible and quantum gates and circuits. We explore metrics related to the frequency of edges with non-zero weight for the entire QMDD data structure and their histograms with respect to each variable. ...
متن کاملMinimization of Average Path Length in BDDs by Variable Reordering
Minimizing the Average Path Length (APL) in a BDD reduces the time needed to evaluate Boolean functions represented by BDDs. This paper describes an efficient heuristic APL minimization procedure based on BDD variable reordering. The reordering algorithm is similar to classical variable sifting with the cost function equal to the APL rather than the number of BDD nodes. The main contribution of...
متن کاملSample Method for Minimization of OBDDs
This paper contributes to the solution of the minimization problem of Ordered Binary Decision Diagrams by means of variable reordering. We suggest a new heuristic that is based on sampling. A small OBDD sample is chosen from the OBDDs that are considered for minimization. Solving the problem for this small sample, we obtain a variable order that is adapt for the entire OBDDs. We present rst exp...
متن کاملExact and Heuristic Minimization of Determinant Decision Diagrams
Determinant Decision Diagram (DDD) is a variant of binary decision diagrams (BDDs) for representing symbolic matrix determinants and cofactors in symbolic circuit analysis. DDD-based symbolic analysis algorithms have time and space complexities proportional to the number of DDD vertices. Inspired by the ideas of Rudell, Drechsler, et. al. on BDD minimization, we present lowerbound based exact a...
متن کاملLinear Sifting of Decision Diagrams yChristoph
We propose a new algorithm, called linear sifting, for the optimization of decision diagrams that combines the ee-ciency of sifting and the power of linear transformations. We show that the new algorithm is applicable to large examples , and that in many cases it leads to substantially more compact diagrams when compared to simple variable reordering. We show in what sense linear transformation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Multiple-Valued Logic and Soft Computing
دوره 13 شماره
صفحات -
تاریخ انتشار 2007